Lower Bounds for Straight Line Factoring
نویسنده
چکیده
Straight line factoring algorithms include a variant Lenstra’s elliptic curve method. This note proves lower bounds on the length of straight line factoring algorithms.
منابع مشابه
Lower Bounds for Factoring Integral-Generically
An integral-generic factoring algorithm is, loosely speaking, a constant sequence of ring operations that computes an integer whose greatest common divisor with a given integral random variable n, such as an RSA public key, is non-trivial. Formal definitions for generic factoring will be stated. Integral-generic factoring algorithms seem to include versions of trial division and Lenstra’s ellip...
متن کاملImproved Lower Bounds on the Area Requirements of Series-Parallel Graphs
We show that there exist series-parallel graphs requiring Ω(n2 √ ) area in any straight-line or poly-line grid drawing. Such a result is achieved in two steps. First, we show that, in any straight-line or poly-line drawing of K2,n, one side of the bounding box has length Ω(n), thus answering two questions posed by Biedl et al. Second, we show a family of series-parallel graphs requiring Ω(2 √ )...
متن کاملLower Bounds on the Area Requirements of Series-Parallel Graphs
We show that there exist series-parallel graphs requiring Ω(n2 √ ) area in any straight-line or poly-line grid drawing. Such a result is achieved in two steps. First, we show that, in any straight-line or poly-line drawing of K2,n, one side of the bounding box has length Ω(n), thus answering two questions posed by Biedl et al. Second, we show a family of series-parallel graphs requiring Ω(2 √ )...
متن کاملCompatible Matchings for Bichromatic Plane Straight-line Graphs
Two plane graphs with the same vertex set are compatible if their union is again a plane graph. We consider bichromatic plane straight-line graphs with vertex set S consisting of the same number of red and blue points, and (perfect) matchings which are compatible to them. For several different classes C of graphs, we present lower and upper bounds such that any given graph G(S) ∈ C admits a com...
متن کاملDegree Bounds for Constrained Pseudo-Triangulations
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S,E). For the case that G forms a simple polygon P with vertex set S we give tight bounds on the vertex degree of TG.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2010 شماره
صفحات -
تاریخ انتشار 2010